Learning and Extending Sublanguages
نویسندگان
چکیده
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a part of the target language is available. Examples of language families are exhibited that are learnable in one model and not learnable in another one. Some characterizations for learnability of algorithmically enumerable families of languages for the models in question are obtained. Since learnability of any part of the target language does not imply monotonicity of the learning process, we consider also our models under additional monotonicity constraint.
منابع مشابه
Organizational Learning and Knowledge Spillover in Innovation Networks: Agent-Based Approach (Extending SKIN Framework)
In knowledge-based economy, knowledge has a public good and non-rivalry nature. Firms build their own knowledge stock not only by means of internal R&D and collaboration with partners, but also by means of previously spilled over knowledge of other firms and public research laboratories (such as universities). Firms based on their absorptive capacity, and level of intra-industry and extra-indus...
متن کاملLearnability of the Classic Knowledge Representation Language
Much of the work in inductive learning considers languages that represent hypotheses using some restricted form of propositional logic; an important research problem is extending propo-sitional learning algorithms to use more expressive rst-order representations. Further, it is desirable for these algorithms to have solid theoretical foundations, so that their behavior is reliable and predictab...
متن کاملFrom SHOQ(D) Toward E-connections
In this paper, we propose a tableau-based technique for reasoning with various distributed DL knowledge bases. This technique can be applied both to DDLs and to new and relevant sublanguages of basic E-connections. Its main advantage is that it is straightforward to implement by extending the existing tableau-based algorithms, as witnessed by our implementation in the Pellet OWL reasoner.
متن کاملFormulas for Calculating Supremal Controllable and Normal Sublanguages
Supremal controllable and normal sublanguages have been shown to play an important role in supervisor synthesis. In this paper, we discuss the computation of supremal controllable and normal sublanguages. We derive formulas for both supremal controllable sublanguages and supremal normal sublanguages when the languages involved are closed. As a result, those languages can be computed without app...
متن کاملMachine Learning of Language Translation Rules
The purpose of this paper is to present learning methods for creating language translation rules from multilingual text samples. The languages concerned are controlled languages, i.e. they are domain specific sublanguages with ambiguities eliminated by restricting the vocabulary and syntax. Learning methods presented here enable a supervised, human-assisted learning of generalised translation r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 397 شماره
صفحات -
تاریخ انتشار 2006